A dynamic nurse scheduling using reinforcement learning: Dealing with various sudden absences of a nurse
نویسندگان
چکیده
منابع مشابه
Scheduling Nurse Shifts Using Goal Programming Based on Nurse Preferences: A Case Study in an Emergency Department
Nowadays, nurses scheduling is one of the most important challenges with which health care centers are encountered. The significance of nurses’ work quality has led researchers to be concerned about scheduling problems, which have an impact on nurses’ performance. Observing the interests of hospital and patients, providing their satisfaction, and meeting their needs are among the main objective...
متن کاملA Nurse Scheduling Model under Real Life Constraints
Background and Objectives: In this paper, a real life nurse scheduling model is described based on the conditions in Iranian hospitals such as monthly shift rotation, consecutive morning and evening shifts and consecutive evening and night shift. Methods: The developed model considers both hospital constraints and nurses’ preferences. Hospital constraints include assigning adequate qualifie...
متن کاملRole of a Nurse in Patients’ Recovery
کنفرانس ملی استانداردهای احیاء قلبی- ریوی (CPR) و مراقبتهای اضطراری قلبی عنوان نموده که تمامی پرسنل بهداشتی باید آموزشهای لازم را در مورد تکنیکهای حمایت اساسی حیات دریافت کنند. این تکنیکها شامل ۱) شناسایی انسداد راه هوایی، ۲) شناسایی ایست قلبی یا تنفسی، 3) توانایی انجام احیای قلبی ریوی (CPR) بیمار است.
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملClassification of Various Neighborhood Operations for the Nurse Scheduling Problem
Since the nurse scheduling problem (NSP) is a problem of finding a feasible solution, the solution space must include infeasible solutions to solve it using a local search algorithm. However, the solution space consisting of all the solutions is so large that the search requires much CPU time. In the NSP, some constraints have higher priority. Thus, we can define the solution space to be the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of International Conference on Artificial Life and Robotics
سال: 2023
ISSN: ['2188-7829', '2435-9157']
DOI: https://doi.org/10.5954/icarob.2023.gs1-2